A Complete Algebraic Solvability Test for the Nonstrict Lyapunov Inequality
نویسنده
چکیده
For arbitrary equally sized square complex matrices A and Q (Q Hermitian), the paper provides a complete algebraic test for verifying the existence of a Hermitian solution X of the nonstrict Lyapunov inequality A X + XA + Q 0: If existing, we exhibit how to construct a solution. Our approach involves the validation problem for the linear matrix inequality P k j=1 (A j X j B j + B j X j A j) + Q > 0 in X j , for which we provide an algebraic solvability test and a procedure to construct solutions if the kernels of A j or, dually, those of B j form an isotonic sequence. 0 C + is the complex plane, partitioned into the open left-half plane, the imaginary axis, and the open right-half plane. For a subspace S C n , A ? S denotes the preimage fx 2 C m j A x 2 Sg of S under the-th power A of A 2 C nn .
منابع مشابه
Sufficient conditions for the genericity of feedback stabilisability of switching systems via Lie-algebraic solvability
This paper addresses the stabilisation of discrete-time switching linear systems (DTSSs) with control inputs under arbitrary switching, based on the existence of a common quadratic Lyapunov function (CQLF). The authors have begun a line of work dealing with control design based on the Lie-algebraic solvability property. The present paper expands on earlier work by deriving sufficient conditions...
متن کاملGeneralized Theorem of The Alternatives-Based Approach to Lyapunov Stability Analysis for LTI Systems
Theorem of the alternatives for linear matrix inequality based on the separation theorems are proposed to provide systematic and unified proofs of necessary and sufficient conditions for solvability of Lyapunov inequality on P . As an application of the Theorem of the alternatives, we investigate the conditions for the existence of feasible solutions to Lyapunov inequality on P and obtain a res...
متن کاملController Design with Trajectory Sensitivity Minimization Using LMI
Linear quadratic regulator (LQR) with trajectory sensitivity minimization and structurally constrained controller was formulated in [2] and [4]. In these works, a gradient search method, which is a particular type of nonlinear programming, was used to solve the problem. In this paper, we propose a linear matrix inequality (LMI)-based method for the problem. This LMI is formulated with block-dia...
متن کاملConstructions of Strict Lyapunov Functions for Discrete Time and Hybrid Time-Varying Systems
We provide explicit closed form expressions for strict Lyapunov functions for time-varying discrete time systems. Our Lyapunov functions are expressed in terms of known nonstrict Lyapunov functions for the dynamics and finite sums of persistency of excitation parameters. This provides a discrete time analog of our previous continuous time Lyapunov function constructions. We also construct expli...
متن کاملAn extension of the positive real lemma to descriptor systems
The well-known positive real lemma characterizes positive realness of transfer functions of timeinvariant linear systems via the solvability of certain linear matrix inequalities. In this paper, we propose an extension of the positive real lemma and the underlying linear matrix inequalities to descriptor systems. We show that the solvability of these linear matrix inequalities is sufficient and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995